How Long Will It Take? Accurate Prediction of Ontology Reasoning Performance

نویسندگان

  • Yong-Bin Kang
  • Jeff Z. Pan
  • Shonali Krishnaswamy
  • Wudhichart Sawangphol
  • Yuan-Fang Li
چکیده

For expressive ontology languages such as OWL 2 DL, classification is a computationally expensive task— 2NEXPTIME-complete in the worst case. Hence, it is highly desirable to be able to accurately estimate classification time, especially for large and complex ontologies. Recently, machine learning techniques have been successfully applied to predicting the reasoning hardness category for a given (ontology, reasoner) pair. In this paper, we further develop predictive models to estimate actual classification time using regression techniques, with ontology metrics as features. Our largescale experiments on 6 state-of-the-art OWL 2 DL reasoners and more than 450 significantly diverse ontologies demonstrate that the prediction models achieve high accuracy, good generalizability and statistical significance. Such prediction models have a wide range of applications. We demonstrate how they can be used to efficiently and accurately identify performance hotspots in a large and complex ontology, an otherwise very time-consuming and resource-intensive task.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Context-aware Modeling for Spatio-temporal Data Transmitted from a Wireless Body Sensor Network

Context-aware systems must be interoperable and work across different platforms at any time and in any place. Context data collected from wireless body area networks (WBAN) may be heterogeneous and imperfect, which makes their design and implementation difficult. In this research, we introduce a model which takes the dynamic nature of a context-aware system into consideration. This model is con...

متن کامل

INTEGRATING CASE-BASED REASONING, KNOWLEDGE-BASED APPROACH AND TSP ALGORITHM FOR MINIMUM TOUR FINDING

Imagine you have traveled to an unfamiliar city. Before you start your daily tour around the city, you need to know a good route. In Network Theory (NT), this is the traveling salesman problem (TSP). A dynamic programming algorithm is often used for solving this problem. However, when the road network of the city is very complicated and dense, which is usually the case, it will take too long fo...

متن کامل

Ontologies and Planners A Statement of Interest

• decoupling planner user interface from planner and executive software components, by declarative specifications of information. In this statement of interest, I will briefly discuss challenges and opportunities in each of these areas. I will also briefly discuss the de facto standard ontology, PDDL (Ghallab et al. 1998; McDermott 2000; Fox & Long 2002), and how it relates to these topics. I h...

متن کامل

Back of the Envelope Reasoning for Robust Quantitative Problem Solving

Humans routinely answer questions, make decisions, and provide explanations in the face of incomplete knowledge and time constraints. From everyday questions like “What will it cost to take that vacation?” to policy questions like “How can a carbon taxing scheme affect climate change?” we often do not have all the knowledge, time and computational resources to come up with a precise, accurate a...

متن کامل

Performance Heterogeneity and Approximate Reasoning in Description Logic Ontologies

Due to the high worst case complexity of the core reasoning problem for the expressive profiles of OWL 2, ontology engineers are often surprised and confused by the performance behaviour of reasoners on their ontologies. Even very experienced modellers with a sophisticated grasp of reasoning algorithms do not have a good mental model of reasoner performance behaviour. Seemingly innocuous change...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2014